Message delay and DisCSP search algorithms
نویسندگان
چکیده
منابع مشابه
Message delay and Asynchronous DisCSP search
Distributed constraint satisfaction problems (DisCSPs) are composed of agents, each holding its own variables, that are connected by constraints to variables of other agents. Due to the distributed nature of the problem, message delay can have unexpected effects on the behavior of distributed search algorithms on DisCSPs. This has been shown in experimental studies of asynchronous backtracking ...
متن کاملParllel Backtrack Search on DisCSP
A parallel algorithm for solving distributed constraint networks (DCNs) is presented. The DCNs are composed of agents, each holding a local network of constraints, where all agents are connected by constraints. The parallel backtracking algorithm (PBT) initiates multiple search processes (SPs) that operate in parallel. Parallel search processes scan different parts of the search tree, each repr...
متن کاملCommunication and Computation in DisCSP Algorithms?
We introduce SensorDCSP, a naturally distributed benchmark based on a real-world application that arises in the context of networked distributed systems. In order to study the performance of DisCSP algorithms in a truly distributed setting, we use a discrete-event network simulator, which allows us to model the impact of different network traffic conditions on the performance of the algorithms....
متن کاملSynchronous, Asynchronous and Hybrid Algorithms for DisCSP
There is some debate about the kind of algorithms that are most suitable to solve DisCSP. Synchronous algorithms exchange updated information with a low degree of parallelism. Asynchronous algorithms use less updated information with a higher parallelism. Hybrid algorithms combine both features. Lately, there is some evidence that synchronous algorithms could be more efficient than asynchronous...
متن کاملOn the Evaluation of DisCSP Algorithms?
Not every research paper in DisCSP evaluates algorithms in the same way. Motivated by this fact, we revise some elements of the area of distributed algorithms as well as distributed constraints, which can help to develop a wellfounded methodology for evaluation of DisCSP algorithms. Although preliminary, we suggest a number of points which should be considered in such methodology.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Mathematics and Artificial Intelligence
سال: 2006
ISSN: 1012-2443,1573-7470
DOI: 10.1007/s10472-006-9033-2